Learning Planning Rules in Noisy Stochastic Worlds
نویسندگان
چکیده
We present an algorithm for learning a model of the effects of actions in noisy stochastic worlds. We consider learning in a 3D simulated blocks world with realistic physics. To model this world, we develop a planning representation with explicit mechanisms for expressing object reference and noise. We then present a learning algorithm that can create rules while also learning derived predicates, and evaluate this algorithm in the blocks world simulator, demonstrating that we can learn rules that effectively model the world dynamics.
منابع مشابه
Learning Symbolic Models of Stochastic Domains
In this article, we work towards the goal of developing agents that can learn to act in complex worlds. We develop a probabilistic, relational planning rule representation that compactly models noisy, nondeterministic action effects, and show how such rules can be effectively learned. Through experiments in simple planning domains and a 3D simulated blocks world with realistic physics, we demon...
متن کاملProceedings of the IJCAI 2005 Workshop on Planning and Learning in A Priori Unknown or Dynamic Domains
We present an algorithm for learning a model of the effects of actions in noisy stochastic worlds. We consider learning in a 3D simulated blocks world with realistic physics. To model this world, we develop a planning representation with explicit mechanisms for expressing object reference and noise. We then present a learning algorithm that can create rules while also learning derived predicate...
متن کاملLearning probabilistic planning operators from noisy observations
Building agents which can learn to act autonomously in the world is an important challenge for artificial intelligence. While autonomous agents often have to operate in noisy, uncertain worlds, current methods to learn action models from agents’ experiences typically assume fully deterministic worlds. This paper presents a noise-tolerant approach to learning probabilistic planning operators fro...
متن کاملPlanning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually interpretable and they can be learned effectively from the action experiences in complex worlds. We investigate reasoning with such rules in grounded relational domains. Our algorithms exploit the compactness of rules fo...
متن کاملPAC Reinforcement Learning in Noisy Continuous Worlds
Continuous state spaces and stochastic, switching dynamics characterize a number of rich, real-world domains, such as robot navigation across varying terrain. We describe a reinforcement-learning algorithm for learning in such domains. We prove that this algorithm is provably approximately correct for certain environments. Unfortunately, no optimal planning techniques exist in general for such ...
متن کامل